Partial - Order Planning with Concurrent Interacting
نویسندگان
چکیده
In order to generate plans for agents with multiple actuators, agent teams, or distributed controllers, we must be able to represent and plan using concurrent actions with interacting eeects. This has historically been considered a challenging task requiring a temporal planner with the ability to reason explicitly about time. We show that with simple modiications, the STRIPS action representation language can be used to represent interacting actions. Moreover, algorithms for partial-order planning require only small modiications in order to be applied in such multiagent domains. We demonstrate this fact by developing a sound and complete partial-order planner for planning with concurrent interacting actions, POMP, that extends existing partial-order planners in a straightforward way. These results open the way to the use of partial-order planners for the centralized control of cooperative multiagent systems.
منابع مشابه
Planning with Concurrent Interacting Actions
In order to generate plans for agents with multiple actuators or agent teams, we must be able to represent and plan using concurrent actions with interacting effects. Historically, this has been considered a challenging task that could require a temporal planner. We show that, with simple modifications, the STRIPS action representation language can be used to represent concurrent interacting ac...
متن کاملPartial-Order Planning with Concurrent Interacting Actions
In order to generate plans for agents with multiple actuators, agent teams, or distributed controllers, we must be able to represent and plan using concurrent actions with interacting e ects. This has historically been considered a challenging task requiring a temporal planner with the ability to reason explicitly about time. We show that with simple modi cations, the STRIPS action representati...
متن کاملFaster Optimal Planning with Partial-Order Pruning
When planning problems have many kinds of resources or high concurrency, each optimal state has exponentially many minor variants, some of which are “better” than others. Standard methods like A∗ cannot effectively exploit these minor relative differences, and therefore must explore many redundant, clearly suboptimal plans. We describe a new optimal search algorithm for planning that leverages ...
متن کاملDIRECTED UNFOLDING Reachability Analysis of Concurrent Systems & Applications to Automated Planning
The factored state representation and concurrency semantics of Petri nets are closely related to those of classical planning models, yet automated planning and Petri net analysis have developed independently, with minimal and mainly unconvincing attempts at crossfertilisation. This thesis exploits the relationship between the formal reachability problem, and the automated planning problem, via ...
متن کاملExploiting Object Escape and Locking Information in Partial-Order Reductions for Concurrent Object-Oriented Programs
Explicit-state model checking tools often incorporate partial-order reductions to reduce the number of system states explored (and thus the time and memory required) for verification. As model checking techniques are scaled up to software systems, it is important to develop and assess partial-order reduction strategies that are effective for addressing the complex structures found in software a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001